Polynomial Preserving Recovery for Meshes from Delaunay Triangulation or with High Aspect Ratio
نویسنده
چکیده
A newly developed polynomial preserving gradient recovery technique is further studied. The results are twofold. First, error bounds for the recovered gradient are established on the Delaunay type mesh when the major part of the triangulation is made of near parallelogram triangle pairs with -perturbation. It is found that the recovered gradient improves the leading term of the error by a factor . Secondly, the analysis is performed for a highly anisotropic mesh where the aspect ratio of element sides is unbounded. When the mesh is adapted to the solution that has significant changes in one direction but very little, if any, in another direction, the recovered gradient can be superconvergent. © 2007Wiley Periodicals, Inc. NumerMethods Partial Differential Eq 24: 960–971, 2008
منابع مشابه
Enhancing Eigenvalue Approximation by Gradient Recovery
The polynomial preserving recovery (PPR) is used to enhance the finite element eigenvalue approximation. Remarkable fourth order convergence is observed for linear elements under structured meshes as well as unstructured initial meshes (produced by the Delaunay triangulation) with the conventional bisection refinement.
متن کاملTopologically Reliable Approximation of Trimmed Polynomial Surface Patches
We present an unstructured triangular mesh generation algorithm that approximates a set of mutually nonintersecting simple trimmed polynomial parametric surface patches within a user specified geometric tolerance. The proposed method uses numerically robust interval geometric representations/computations and also addresses the problem of topological consistency (homeomorphism) between the exact...
متن کاملSnow Globe: An Advancing-Front 3D Delaunay Mesh Refinement Algorithm
One of the objectives of a Delaunay mesh refinement algorithm is to produce meshes with tetrahedral elements having a bounded aspect ratio, which is the ratio between the radius of the circumscribing and inscribing spheres. The refinement is carried out by inserting additional Steiner vertices inside the circumsphere of a poor-quality tetrahedron (to remove the tetrahedron) at a sufficient dist...
متن کاملAdaptive Dynamic Projection-Based Partitioning for Parallel Delaunay Mesh Generation Algorithms
Meshes of high quality are an important ingredient for many applications in scientific computing. An accurate discretization of the problem geometry with elements of good aspect ratio is required by many numerical methods. In the finite element method, for example, interpolation error is related to the largest element angle in the mesh [1]. There is a critical need for algorithms that can gener...
متن کاملFeature preserving Delaunay mesh generation from 3D multi-material images
Generating realistic geometric models from 3D segmented images is an important task in many biomedical applications. Segmented 3D images impose particular challenges for meshing algorithms because they contain multimaterial junctions forming features such as surface patches, edges and corners. The resulting meshes should preserve these features to ensure the visual quality and the mechanical so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006